The generalised Oberwolfach problem
نویسندگان
چکیده
We prove that any quasirandom dense large graph in which all degrees are equal and even can be decomposed into given collection of two-factors (2-regular spanning subgraphs). A special case this result gives a new solution to the Oberwolfach problem.
منابع مشابه
The Oberwolfach Problem in Graph Theory
During the summer of 2007, I participated in a Research Experience for Undergraduates (REU) at Illinois State University. I was one of eight undergraduates, all of whom were mathematics education majors. During my eight week experience, we worked with four in-service teachers from the Normal-Bloomington area, as well as math and math education professors from Illinois State and surrounding univ...
متن کاملSome results on the Oberwolfach problem
The well-known Oberwolfach problem is to show that it is possible to 2-factorize Kn (n odd) or Kn less a 1-factor (n even) into predetermined 2-factors, all isomorphic to each other; a few exceptional cases where it is not possible are known. In this paper we introduce a completely new technique which enables us to show that there is a solution when each 2-factor consists of k r-cycles and one ...
متن کاملOberwolfach rectangular table negotiation problem
We completely solve certain case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Let H(k, 3) be a bipartite graph with bipartition X = {x1, x2, . . . , xk}, Y = {y1, y2, . . . , yk} and edges x1 y1, x1 y2, xk yk−1, xk yk , and xi yi−1, xi yi , xi yi+1 for i = 2, 3, . . . , k − 1. We completely characterize all complete bipartite graphs Kn,n ...
متن کاملOn the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملSome Cyclic Solutions to the Three Table Oberwolfach Problem
We use graceful labellings of paths to give a new way of constructing terraces for cyclic groups. These terraces are then used to find cyclic solutions to the three table Oberwolfach problem, OP(r, r, s), where two of the tables have equal size. In particular we show that, for every odd r ≥ 3 and even r with 4 ≤ r ≤ 16, there is a number Nr such that there is a cyclic solution to OP(r, r, s) wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.09.007